Covering n-Segment Unit Arcs Is Not Sufficient

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Policy Capacity Is Necessary but Not Sufficient; Comment on “Health Reform Requires Policy Capacity”

Policy capacity focuses on the managerial and organizational abilities to inform policy decisions with sound research and analysis, and facilitate policy implementation with operational efficiency. It stems from a view of the policy process that is rational and positivistic, in which optimal policy choices can be identified, selected, and implemented with objectivity. By itself, however, policy...

متن کامل

Concealing Block Sizes Is Not Sufficient

correctly noted that blocked randomiza-tion has a disadvantage that " the executer can predict the next assignment " and this is clearly incompatible with allocation concealment. So we can agree that permuted blocks with a fixed block size should never be used in ran-domized trials. 2) But what is the solution to this problem? Kim and Shin 1) indicated that " To solve this problem, the allocato...

متن کامل

Intel SGX Remote Attestation is not sufficient

Intel SGX enclaves provide hardware enforced confidentiality and integrity guarantees for running pure computations (i.e., OS-level side-effect-free code) in the cloud environment. In addition, SGX remote attestation enables enclaves to prove that a claimed enclave is indeed running inside a genuine SGX hardware and not some (adversary controlled) SGX simulator. Since cryptographic protocols do...

متن کامل

New Large (n, r)-arcs in PG(2, q)

An $(n, r)$-arc is a set of $n$ points of a projective plane such that some $r$, but no $r+1$ of them, are collinear. The maximum size of an $(n, r)$-arc in  $PG(2, q)$ is denoted by $m_r(2,q)$.  In this paper we present  a new $(184,12)$-arc in PG$(2,17),$  a new $(244,14)$-arc and a new $(267,15$)-arc in $PG(2,19).$

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete & Computational Geometry

سال: 2007

ISSN: 0179-5376,1432-0444

DOI: 10.1007/s00454-006-1258-7